home
***
CD-ROM
|
disk
|
FTP
|
other
***
search
/
Pascal Super Library
/
Pascal Super Library (CW International)(1997).bin
/
MATH
/
EEV100R1
/
READ.ME
< prev
next >
Wrap
Text File
|
1992-02-02
|
3KB
|
60 lines
---------------------------------
Packing List for EEV100R1.ZIP
---------------------------------
Expression Evaluator Toolkit V1.00 Revision 1
These files provide you with a complete API for 2 mathematical
expression evaluators. One is written to evaluate infix (algebraic)
expressions. The other is written to evaluate postfix (RPN)
expressions. The complete source is provided to both units.
INFIX.PAS Source for INFIX expression evaluator (TP5.0, TP5.5 or TP6.0)
INFIX.TPU Compiled TPU for TP5.5
INFIX.DOC How to use the expression evaluator API
TESTI.PAS Short test program I used during debugging. I used TD,
so either run in TD or add your own writeln statements.
POSTFIX.PAS Source for RPN expression evaluator (TP5.0, TP5.5 or TP6.0)
POSTFIX.TPU Compiled TPU for TP5.5
POSTFIX.DOC How to use the expression evaluator API
DFSTR.PAS Unit containing string functions used by POSTFIX.PAS
DFSTR.TPU Compiled unit for TP5.5
TESTP.PAS Short test program I used during debugging. Use TD.
TESTP2.PAS Another short test program. Prompts for expression
and then evaluates it.
POSTFIX.INC Source for RPN expression evaluator (TP3.0)
DFSTR.INC Source for TP3 string routines ad declarations
TESTP3.PAS Short test program for TP3.0 evaluator
INFIX.PAS is based upon a program called CALC.PAS by James L. Dean of
New Orleans, LA. His program, dated 1985, provided the complete
recursive descent infix expression evaluator. CALC.PAS was downloaded
from CIS and had no copyright notice of any kind. Because of the lack
of any copyright, I assume that I can write a derivitive work. I added
the variables support and organized the code for use with TP5 or higher.
His name, address, and original comments (very few) have been competely
preserved in the source and my documentation file.
My brief experience with the Forth language has shown me that RPN notation
is much more efficient than infix. I wrote POSTFIX.PAS completely from
scratch to provide a better evaluator than INFIX. The resulting code is
leaner and meaner, but provides the same capabilities. Take your pick and
enjoy.
INFIX and POSTFIX are hereby released into the public domain for use without
royalties of any kind. However, you may not sell the source or TPUs for
profit. If you modify either program for distribution, please leave the
names of the author(s) and their comments intact.
David J. Firth
5665-A2 Parkville St.
Columbus, OH 43229
Updated release: V1.00 R1 - 2/2/92 - TP3.0 support added
Original release: V1.00 R0 - 1/3/92